Simultaneous Optimal Boundary Encoding and Variable-Length Code Selection
نویسندگان
چکیده
This paper describes e cient and optimal encoding and representation of object contours. Contours are approximated by connected second-order spline segments, each de ned by three consecutive control points. The placement of the control points is done optimally in the rate-distortion (RD) sense and jointly with their entropy encoding. We utilize a di erential scheme for the rate and an additive area-based metric for the distortion to formulate the problem as Lagrangian minimization. We investigate the sensitivity of the resulting operational RD curve on the variable length codes used and propose an iterative procedure arriving at the entropy representation of the original boundary for any given rate-distortion tradeo .
منابع مشابه
An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling
Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...
متن کاملA new indirect encoding method with variable length gene code to optimize neural network structures
A new encoding method for optimizing neural network structures is proposed. It is based on an indirect encoding method with variable length gene code. The search ability for finding an optimal solution is higher than the direct encoding methods because redundant information in gene code is reduced and the search space is also reduced. The proposed method easily operates adding and deleting hidd...
متن کاملAn optimal lossy segmentation encoding scheme
In this paper, we present a fast and optimal method for the lossy encoding of object boundaries which are given as 8-connect chain codes. We approximate the boundary by a polygon and consider the problem of nding the polygon which can be encoded with the smallest number of bits for a given maximum distortion. To this end, we derive a fast and optimal scheme which is based on a shortest path alg...
متن کاملOptimal Piecewise Linear Image Coding
Piecewise linear (PL) image coding proceeds in three steps: 1. A digital image is converted into a 1D-signal using a scanning procedure, for example by scanning lines in a zigzag or Hilbert order. 2. The signal is approximated by the graph of a piecewise linear function, which consists of a nite number of connected line segments. 3. Entropy encoding of the sequence of the segment end points. In...
متن کاملExponential bounds on error probability with Feedback
Feedback is useful in memoryless channels for decreasing complexity and increasing reliability; the capacity of the memoryless channels, however, can not be increased by feedback. For fixed length block codes even the decay rate of error probability with block length does not increase with feedback for most channel models. Consequently for making the physical layer more reliable for higher laye...
متن کامل